Selectivity and Metaplasticity in a Unified Calcium-Dependent Model

A unified, biophysically motivated Calcium-Dependent Learning model has been shown to account for various rate-based and spike time-dependent paradigms for inducing synaptic plasticity. Here, we investigate the properties of this model for a multi-synapse neuron that receives inputs with different spike-train statistics. In addition, we present a physiological form of metaplasticity, an activity-driven regulation mechanism, that is essential for the robustness of the model. A neuron thus implemented develops stable and selective receptive fields, given various input statistic

Investigation and characterization of constraint effects on flaw growth during fatigue loading of composite materials

An investigative program is presented in an attempt to add to the current understanding of constraint effects on the response of composite materials under cyclic loading. The objectives were: (1) to use existing data and to develop additional data in order to establish an understanding and quantitative description of flaw growth in unidirectional lamina under cyclic loading at different load direction to fiber direction angles; (2) to establish a similar understanding and description of flaw growth in lamina which are embedded in laminates between other unflawed lamina; (3) to determine the nature of the influence of constraint on flaw growth by quantitatively comparing the results of the tests; and (4) to develop a model and philosophy of constraints effects based on our investigative results

Coarsening Dynamics of a One-Dimensional Driven Cahn-Hilliard System

We study the one-dimensional Cahn-Hilliard equation with an additional driving term representing, say, the effect of gravity. We find that the driving field $E$ has an asymmetric effect on the solution for a single stationary domain wall (or `kink'), the direction of the field determining whether the analytic solutions found by Leung [J.Stat.Phys.{\bf 61}, 345 (1990)] are unique. The dynamics of a kink-antikink pair (`bubble') is then studied. The behaviour of a bubble is dependent on the relative sizes of a characteristic length scale $E^{-1}$, where $E$ is the driving field, and the separation, $L$, of the interfaces. For $EL \gg 1$ the velocities of the interfaces are negligible, while in the opposite limit a travelling-wave solution is found with a velocity $v \propto E/L$. For this latter case ($EL \ll 1$) a set of reduced equations, describing the evolution of the domain lengths, is obtained for a system with a large number of interfaces, and implies a characteristic length scale growing as $(Et)^{1/2}$. Numerical results for the domain-size distribution and structure factor confirm this behavior, and show that the system exhibits dynamical scaling from very early times.Comment: 20 pages, revtex, 10 figures, submitted to Phys. Rev.

Electrophysiological correlates of anterior cingulate function in a Go/NoGo task: effects of response conflict and trial-type frequency.

Neuroimaging and computational modeling studies have led to the suggestion that response conflict monitoring by the anterior cingulate cortex plays a key role in cognitive control. For example, response conflict is high when a response must be withheld (no-go) in contexts in which there is a prepotent tendency to make an overt (go) response. An event-related brain potential (ERP) component, the N2, is more pronounced on no-go than on go trials and was previously thought to reflect the need to inhibit the go response. However, the N2 may instead reflect the high degree of response conflict on no-go trials. If so, an N2 should also be apparent when subjects make a go response in conditions in which no-go events are more common. To test this hypothesis, we collected high-density ERP data from subjects performing a go/no-go task, in which the relative frequency of go versus no-go stimuli was varied. Consistent with our hypothesis, an N2 was apparent on both go and no-go trials and showed the properties expected of an ERP measure of conflict detection on correct trials: (1) It was enhanced for low-frequency stimuli, irrespective of whether these stimuli were associated with generating or suppressing a response, and (2) it was localized to the anterior cingulate cortex. This suggests that previous conceptions of the no-go N2 as indexing response inhibition may be in need of revision. Instead, the results are consistent with the view that the N2 in go/no-go tasks reflects conflict arising from competition between the execution and the inhibition of a single response

Request-peer selection for load-balancing in P2P live streaming systems

Theme: Services, Applications and BusinessUnlike peer-to-peer (P2P) file sharing, P2P live streaming systems have to meet real-time playback constraints, which makes it very challenging yet crucial to maximize the peer uplink bandwidth utilization so as to deliver content pieces in time. In general, this is achieved by adopting tailor-made piece selection and request-peer selection algorithms. The design philosophy is to regulate the network traffic and to balance the load among peers. In this paper, we propose a new request-peer selection algorithm. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. An SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored among potential providers. This is because smaller SRT implies excess serving capacity and fewer data pieces suggests less piece requests received. We evaluate the performance of our request-peer selection algorithm through extensive packet level simulations. Our simulation results show that the traffic load in the network is better balanced in the sense that the difference of the normalized number of data packets uploaded by each peer is getting smaller and the number of repeated piece requests generated by each peer (due to request failure) is significantly reduced. We also found that the load of streaming server is reduced, and the overall quality of service, measured by playback continuity, startup delay etc, is improved as well. © 2012 IEEE.published_or_final_versio

Measurement of Lagrangian velocity in fully developed turbulence

We have developed a new experimental technique to measure the Lagrangian velocity of tracer particles in a turbulent flow, based on ultrasonic Doppler tracking. This method yields a direct access to the velocity of a single particule at a turbulent Reynolds number $R_{\lambda} = 740$. Its dynamics is analyzed with two decades of time resolution, below the Lagrangian correlation time. We observe that the Lagrangian velocity spectrum has a Lorentzian form $E^{L}(\omega) = u_{rms}^{2} T_{L} / (1 + (T_{L}\omega)^{2})$, in agreement with a Kolmogorov-like scaling in the inertial range. The probability density function (PDF) of the velocity time increments displays a change of shape from quasi-Gaussian a integral time scale to stretched exponential tails at the smallest time increments. This intermittency, when measured from relative scaling exponents of structure functions, is more pronounced than in the Eulerian framework.Comment: 4 pages, 5 figures. to appear in PR

Closest playback-point first: A new peer selection algorithm for P2P VoD systems

Peer-to-peer (P2P) based video-on-demand (VoD) streaming service has been gaining popularity recently. Unlike live streaming, a VoD peer always starts its playback from the beginning of a stored video. The playback-points of different peers, as well as the amount of video contents/pieces they cached, depend on when they join the video session, or their viewing ages. As a result, the upload bandwidth of younger peers tends to be underutilized because older peers are not interested in their cached video pieces. The collaborative piece exchange among peers is undermined due to the unbalanced supply and demand. To address this issue, a playback-point based request peer selection algorithm is proposed in this paper. Specifically, when a peer requests a particular video piece, among the set of potential providers, a request is sent to the peer that has the smallest playback-point difference with itself. We call this request peer selection algorithm closest playback-point first (CPF). With CPF, peers with similar available content can be loosely grouped together for a more balanced collaborative piece exchange. Extensive packet-level simulations show that with CPF, the video playback quality is enhanced and the VoD server load is significantly reduced. © 2011 IEEE.published_or_final_versionThe IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 201